Geometric Hashing: Rehashing for Bayesian Voting
نویسندگان
چکیده
Geometric hashing is a model-based recognition technique based on matching of transformation-invariant object representations stored in a hash table. Today it is widely used as an object recognition method in numerous applications. In the last decade a number of enhancements have been suggested to the basic method improving its performance and reliability. Here we consider two of them. One is rehashing, dealing with the problem of non-uniform occupancy of hash bins, and the other is Bayesian approach improving recognition rate in presence of noise. The latter uses an altered matching scheme, where the search is performed over an error dependent voting region around the query. In this paper we propose a scheme that takes the best from both worlds, yielding a hash table with a uniform size of voting regions. This allows to improve the geometric hashing computational performance by minimizing the hash table size and the number of bins accessed, while maintaining optimal recognition rate. Alternatively, the proposed method can be used in classical single bin voting to improve recognition rate. T ec hn io n C om pu te r Sc ie nc e D ep ar tm en t T ec hn ic al R ep or t C IS -2 00 307 2 00 3
منابع مشابه
Using Pattern Recognition for Self-Localization in Semiconductor Manufacturing Systems
In this paper we present a new method for self-localization on wafers using geometric hashing. The proposed technique is robust to image changes induced by process variations, as opposed to the traditional, correlation based methods. Moreover, it eliminates the need in training on reference patterns. Two enhancements are introduced to the basic geometric hashing scheme improving its performance...
متن کاملMinutiae Based Geometric Hashing for Fingerprint Database
This paper proposes an efficient indexing technique for fingerprint database using minutiae based geometric hashing. A fixed length feature vector built from each minutia, known as Minutia Binary Pattern, has been suggested for the accurate match at the time of searching. Unlike existing geometric based indexing techniques, the proposed technique inserts each minutia along with the feature vect...
متن کاملA Model-Based 3-D Object Recognition System using Geometric Hashing with Attributed Features
We build an object recognition system that is able to recognize 3-D objects such as vehicles embedded in highly complicated backgrounds. We use the geometric hashing method, augmenting the approach through the use of attributed features, k-d trees for access to features, and the use of bounds in order to limit the search. We make use of expressive features to improve the performance of a geomet...
متن کاملHashing and Rehashing in Emulated Shared Memory Hashing and Rehashing in Emulated Shared Memory
The PRAM model is widely used to formulate parallel algorithms because of its shared memory and its synchronous behaviour. The model however bears little resemblance to real parallel machines. This has led to various approaches to emulating PRAMs on processor networks. We brieey survey the principles behind these emulations and show why hashing is an important part of them. We discuss the commo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011